An Efficient Clustering Algorithm for Vanet

Vehicular Ad hoc Network (VANET) is a subclass of mobile Ad Hoc network. VANET has become an active area of research to improve the safety of vehicle and road, traffic efficiency, and also to increase the comfort to both drivers and passengers. Due to the high mobility and dynamism, routing the messages to their final destination in VANETs is a challenging task. These issues can be addressed by clustering techniques. Clustering is a mechanism of grouping of vehicles based upon some predefined metrics such as density, velocity, and geographical locations of the vehicles. Clustering in vehicular ad hoc networks (VANET) is one of the control mechanisms for dynamic topology. Many of the VANET clustering algorithms are derived from mobile adhoc networks (MANET). However, VANET nodes are characterized by their high mobility, and the existence of VANET nodes in the same geographic proximity does not mean that they exhibit the same mobility patterns. Therefore the clustering schemes of VANET should consider the speed and velocity of nodes to construct a stable clustering structure. In this paper, we introduce a new clustering technique suitable for the VANET environment with the aim of enhancing the stability of the network cluster. This technique takes the distance and velocity as a parameter to create relatively a stable cluster structure. We also developed a algorithm for super cluster-head selections.